Fractal Compression of Images with Projected Ifs

نویسندگان

  • Éric Guérin
  • Éric Tosan
  • Atilla Baskurt
  • Niels Bohr
چکیده

Standard fractal image compression, proposed by Jacquin[1], is based on IFS (Iterated Function Systems) defined in R. This modelization implies restrictions in the set of images being able to be compressed. These images have to be self similar in R. We propose a new model, the projected IFS, to approximate and code grey level images. This model has the ability to define affine IFS in a high dimension space, and to project it through control points, resulting in a non strictly self similar object in R. We proposed a method for approximating curves with such a model [2, 3]. In this paper, we extend the model capabilities to surfaces and images. This includes the combination of projected IFS in a quadtree structure and a complete coding scheme. First results show that our method gives better results than standard fractal image compression. Furthermore, in the very low bitrate context, the distortion/rate performances are equivalent to those obtained with EZW algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Difference based Non-Linear Fractals using IFS

Fractals are self-similar images. There are many techniques for generating fractals. IFS are one of them. IFS use a set of linear transformations for generation of fractals. We propose a method of modifying IFS such that non-linear transformations can be used for generating pleasant looking fractals. We also show a technique which ensures convergence of the fractal Images. Non-linear fractals h...

متن کامل

IFS Fractal Code for Image Retrieval on Compression Domain

Digital image databases represent huge amount of data, automatic indexing and content base retrieval are crucial factors. IFS ( Iterated function system ) fractal code can be used to retrieve image and the position parameter of IFS code is replaced with the relative distance and direction parameter. A new algorithm of IFS fractal code for image retrieval on compression domain is presented in th...

متن کامل

Fractal Image Compression through Weighted Error Minimisation in the Frequency Domain

IFS compression technique, proposed by Barnsley [1], has been widely studied because of its potentially high compression rates. Usually IFS code is determined by minimizing the rms error between a given image and its collage. As rms error is not a physiological metric, images obtained through the standard IFS coding evidence a lot of noise (blocking effect, bad definition). In order to reduce t...

متن کامل

A DCT-based Metric for Fractal Image Compression

IFS compression technique, proposed by Barnsley [1], has been widely studied because of its potentially high compression rates. Usually IFS code is determined by minimizing the rms error between a given image and its collage. As rms error is not a physiological metric, images obtained through the standard IFS coding evidence a lot of noise (blocking effect, bad definition). In order to reduce t...

متن کامل

Fractal Approximation and Compression Using Projected Ifs

Approximation of natural objects (curves, surfaces, or images) with fractal models is an important center of interest for research. The general inverse problem paradigm concerns many application fields and a large variety of studies have been proposed to address it.The most known of them is the fractal image compression method introduced by Jacquin. Generally speaking, these techniques lack of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003